The Distribution Semantics is Well-Defined for All Normal Programs
نویسنده
چکیده
The distribution semantics is an approach for integrating logic programming and probability theory that underlies many languages and has been successfully applied in many domains. When the program has function symbols, the semantics was defined for special cases: either the program has to be definite or the queries must have a finite number of finite explanations. In this paper we show that it is possible to define the semantics for all programs.
منابع مشابه
Well-definedness and efficient inference for probabilistic logic programming under the distribution semantics
The distribution semantics is one of the most prominent approaches for the combination of logic programming and probability theory. Many languages follow this semantics, such as Independent Choice Logic, PRISM, pD, Logic Programs with Annotated Disjunctions (LPADs) and ProbLog. When a program contains functions symbols, the distribution semantics is well-defined only if the set of explanations ...
متن کاملA Well-Founded Semantics for FOL-Programs
An FOL-program consists of a background theory in a decidable fragment of first-order logic and a collection of rules possibly containing first-order formulas. The formalism stems from recent approaches to tight integrations of ASP with description logics. In this paper, we define a well-founded semantics for FOL-programs based on a new notion of unfounded sets on consistent as well as inconsis...
متن کاملThe distribution semantics for normal programs with function symbols
The distribution semantics integrates logic programming and probability theory using a possible worlds approach. Its intuitiveness and simplicity has made it the most widely used semantics for probabilistic logic programming, with successful applications in many domains. When the program has function symbols, the semantics was defined for special cases: either the program has to be definite or ...
متن کاملReliable Semantics for Extended Logic Programs with Rule Prioritization
We present a new semantics for extended logic programs with rule prioritization (EPP ). The semantics, called reliable semantics (RS), generalizes the well-founded semantics which is defined for normal programs [34]. It also generalizes the extended well-founded semantics which is defined for non-contradictory extended programs [24]. Because of the classical negation in the head of the rules, t...
متن کاملThe Structure and Complexity of Credal Semantics
A flexible semantics has been proposed by Lukasiewicz for probabilistic logic programs where we have a normal logic program augmented with a set of independent probabilistic facts. That semantics, which we call credal semantics, is the set of all probability measures (over stable models) that are consistent with a total choice of probabilistic facts. When each total choice produces a definite p...
متن کامل